Reachability Analysis of Neural Network Control Systems
نویسندگان
چکیده
Neural network controllers (NNCs) have shown great promise in autonomous and cyber-physical systems. Despite the various verification approaches for neural networks, safety analysis of NNCs remains an open problem. Existing control systems (NNCSs) either can only work on a limited type activation functions, or result non-trivial over-approximation errors with time evolving. This paper proposes framework NNCS based Lipschitzian optimisation, called DeepNNC. We first prove Lipschitz continuity closed-loop NNCSs by unrolling eliminating loops. then reveal working principles applying optimisation illustrate it verifying adaptive cruise model. Compared to state-of-the-art approaches, DeepNNC shows superior performance terms efficiency accuracy over wide range NNCs. also provide case study demonstrate capability handle real-world, practical, complex system. Our tool is available at https://github.com/TrustAI/DeepNNC.
منابع مشابه
analysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولEfficient Network Reachability Analysis Using a Succinct Control Plane Representation
To guarantee network availability and security, operators must ensure that their reachability policies (e.g., A can or cannot talk to B) are correctly implemented. This is a difficult task due to the complexity of network configuration and the constant churn in a network’s environment, e.g., new route announcements arrive and links fail. Current network reachability analysis techniques are limi...
متن کاملReachability Analysis of Stochastic Hybrid Systems by Optimal Control
For stochastic hybrid systems, the reachability analysis is an important and difficult problem. In this paper, we prove that, under natural assumptions, reachability analysis can be characterised as an optimal stopping problem. In this way, one can apply numerical methods from optimal control to solve the reachability verification problems.
متن کاملReachability Analysis for a Class of Quantized Control Systems
In this paper we study control systems whose input sets are quantized. We speciically focus on problems relating to the structure of the reachable set of such systems, which may turn out to be either dense or discrete. We report on some recent results on the reachable set of linear quantized systems, and study in detail a particular but interesting class of nonlinear systems, forming the discre...
متن کاملModeling, Control, and Reachability Analysis of Discrete-Time Hybrid Systems
These notes describe a computational framework for modeling, controlling, and analyzing hybrid systems in discrete-time. We describe three classes of hybrid models in detail: discrete hybrid automata (DHA), piecewise affine (PWA) systems, and mixed logical dynamical (MLD) systems. We show the relations among such model classes and other existing model paradigms, such as (extended) linear comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i12.26783